Verifiable quantum oblivious transfer protocol based on entangled states
نویسنده
چکیده
We describe an efficient protocol for verifiable quantum oblivious transfer. The protocol, which can be implemented with present technology, is secure against cheaters with unlimited computing power and with the ability to store the particles for an arbitrarily long period of time. The protocol is based on the following two entangled states: |Φ〉 = 1 √ 2 (|↑↑〉+ |↓ x〉) and |Ψ〉 = 1 √ 2 (|↑↑〉+ |↓ −x〉). email address:[email protected]
منابع مشابه
Quantum oblivious transfer protocol based on entangled states
We describe an efficient protocol for quantum oblivious transfer. The protocol, which can be implemented with present technology, is secure against cheaters with unlimited computing power and with the ability to store the particles for an arbitrarily long period of time. The protocol is based on the following two entangled states: | Φ〉 = 1 √ 2 (|↑↑〉+ |↓ x〉) and |Ψ〉 = 1 √ 2 (|↑↑〉+ |↓ −x〉). PACS ...
متن کاملVerifiable Homomorphic Oblivious Transfer and Private Equality Test
We describe slightly modified version (that we call the HOT protocol) of the Aiello-Ishai-Reingold oblivious transfer protocol from Eurocrypt 2001. In particular, the HOT protocol will be what we call weakly secure when coupled with many different homomorphic semantically secure public-key cryptosystems. Based on the HOT protocol, we construct an efficient verifiable oblivious transfer protocol...
متن کاملSecure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment
In this paper, we have discussed the issues concerning the basic concept and classification of OT (Oblivious Transfer). We have proposed secure verifiable non-interactive oblivious transfer protocols for the exchange of secrets on distributed environments. One is a new secure verifiable noninteractive oblivious transfer protocol using RSA, the other is that with bit commitment using one-way fun...
متن کاملGeneralizing Efficient Multiparty Computation
We focus on generalizing constructions of Batch Single-Choice Cut-And-Choose Oblivious Transfer and Multi-sender k-out-of-n Oblivious Transfer, which are at the core of efficient secure computation constructions proposed by Lindell et al. and the IPS compiler. Our approach consists in showing that such primitives can be based on a much weaker and simpler primitive called Verifiable Oblivious Tr...
متن کاملOblivious transfer based on single-qubit rotations
We present a bit-string quantum oblivious transfer protocol based on single-qubit rotations. The proposed protocol does not violate the Lo’s nogo theorem that prevents the unconditional security of 1-out-of-2 oblivious transfer. Our protocol is based on a previously proposed quantum public key protocol and its security relies on the laws of Quantum Mechanics. We also present a single-bit oblivi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998